Procudere for Definition of Neighborhood in Faulty Hypercube Multiprocessor
نویسندگان
چکیده
منابع مشابه
The longest ring embedding in faulty hypercube
In this paper, we show that the adjacency fault tolerance for property 2H of hypercube. We also show that the adjacency fault tolerance for Hamiltonian laceability of hypercube. Applying these results, we can construct the fault-free cycle with length 2 − 2 | Fv | +4 in Qn − Fv where Fv is the faulty vertices set with at least two black vertices and two white vertices with | Fv |≤ n− 1.
متن کاملDeadlock - Free Routing in a Faulty Hypercube
In massively parallel computers, processors are often connected in a hypercube configuration. Each vertex in the hypercube represents a processor, and each edge represents a communication link. One problem in such a system is avoiding deadlock, a state where there is a cycle of processors, each waiting on the next indefinitely. A second problem is that in a system with many processors, some are...
متن کاملParallel Routing in Hypercube Networks with Faulty Nodes
The concept of strong fault-tolerance was introduced to characterize the property of parallel routing [15]. A network G of degree d is said strongly fault-tolerant if with at most d 2 faulty nodes, any two nodes u and v in G are connected by minfdegf (u); degf (v)g node-disjoint paths, where degf (u) and degf (v) are the numbers of non-faulty neighbors of the nodes u and v in G, respectively. W...
متن کاملOblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock...
متن کاملCycle Embedding in the Hypercube with Faulty Nodes
The hypercube is one of the most versatile and efficient interconnection networks yet discovered for parallel computation. In this paper, we show that a fault-free cycle of length of at least 2 − 2f can be embedded in an n dimensional hypercube with f faulty nodes, where n ≥ 3 and 1 ≤ f ≤ 2n − 4. The best known results thus far can tolerant only n − 1 faulty nodes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 1999
ISSN: 2297-8747
DOI: 10.3390/mca4010017